On the Exact Learnability of Automata with Small Cover Time
نویسنده
چکیده
We present algorithms for exactly learning unknown environments that can be described by deterministic nite automata. The learner performs a walk on the target automaton, where at each step it observes the output of the state it is at, and chooses a labeled edge to traverse to the next state. We assume that the learner has no means of a reset, and we also assume that the learner does not have access to a teacher that gives it counterexamples to its hypotheses. We present two algorithms, one assumes that the outputs observed by the learner are always correct and the other assumes that the outputs might be erroneous. The running times of both algorithms are polynomial in the cover time of the underlying graph of the target automaton.
منابع مشابه
Affectability of time to runoff and runoff coefficient in small laboratory plots to application of organic mulch
Nowadays, organic mulches are used as protective cover for the soil surface.This study in order to investigate the effect of protective cover straw Colza on the components of start time and runoff coefficient in loam – sandy soil in laboratory scale and using a rain simulation with an intensity of 50 mm / h with a 10-minute duration has been done. For this purpose, three levels of protective co...
متن کاملDetection and prediction of land use/ land cover changes using Markov chain model and Cellular Automata (CA-Markov), (Case study: Darab plain)
unprincipled changes in land use are major challenges for many countries and different regions of the world, which in turn have devastating effects on natural resources, Therefore, the study of land-use changes has a fundamental and important role for environmental studies. The purpose of this study is to detect and predicting of land use/ land cover (LULC) changes in Darab plain through the Ma...
متن کاملThe Learnability of Simple Deterministic Finite-memory Automata via Queries
In this paper, we establish the learnability of simple deterministic finitememory automata via membership and equivalence queries. Sim ple deterministic fmitememory automata are a subclass of finitememory automata introduced by Kaminski and Francez (1994) as a model gen eralizing finite automata to infinite alphabets. Continuously, Sakamoto and Ikeda investigated several decision problems for f...
متن کاملThe Learnability of Simple Deterministic Finite-Memory Automata
The present paper establishes the learnability of simple deterministic finitememory automata via membership and equivalence queries. Simple deterministic finite-memory automata are a subclass of deterministic finite-memory automata introduced by Kaminski and Francez [9] as a model generalizing finite-state automata to infinite alphabets. For arriving at a meaningful learning model we first prov...
متن کاملSimulation of Future Land Use Map of the Catchment Area, with the Integration of Cellular Automata and Markov Chain Models Based on Selection of the Best Classification Algorithm: A Case Study of Fakhrabad Basin of Mehriz, Yazd
INTRODUCTION Since the land use change affects many natural processes including soil erosion and sediment yield, floods and soil degradation and the chemical and physical properties of soil, so, different aspects of land use changes in the past and future should be considered particularly in the planning and decision-making. One of the most important applications of remote sensing is land ...
متن کامل